/***************************************************************************
 # Copyright (c) 2015-24, NVIDIA CORPORATION. All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without
 # modification, are permitted provided that the following conditions
 # are met:
 #  * Redistributions of source code must retain the above copyright
 #    notice, this list of conditions and the following disclaimer.
 #  * Redistributions in binary form must reproduce the above copyright
 #    notice, this list of conditions and the following disclaimer in the
 #    documentation and/or other materials provided with the distribution.
 #  * Neither the name of NVIDIA CORPORATION nor the names of its
 #    contributors may be used to endorse or promote products derived
 #    from this software without specific prior written permission.
 #
 # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS "AS IS" AND ANY
 # EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 # PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 # CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 # EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 # PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 # PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 # OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 **************************************************************************/
#pragma once

#include <vector>
#include <filesystem>

namespace Falcor
{
namespace Mitsuba
{
class Resolver
{
public:
    using iterator = std::vector<std::filesystem::path>::iterator;
    using const_iterator = std::vector<std::filesystem::path>::const_iterator;

    size_t size() const { return mPaths.size(); }

    iterator begin() { return mPaths.begin(); }
    iterator end() { return mPaths.end(); }

    const_iterator begin() const { return mPaths.begin(); }
    const_iterator end() const { return mPaths.end(); }

    void erase(iterator it) { mPaths.erase(it); }

    void prepend(const std::filesystem::path& path) { mPaths.insert(mPaths.begin(), path); }
    void append(const std::filesystem::path& path) { mPaths.push_back(path); }
    const std::filesystem::path& operator[](size_t index) const { return mPaths[index]; }
    std::filesystem::path& operator[](size_t index) { return mPaths[index]; }

    std::filesystem::path resolve(const std::filesystem::path& path) const
    {
        for (const_iterator it = mPaths.begin(); it != mPaths.end(); ++it)
        {
            std::filesystem::path combined = *it / path;
            if (std::filesystem::exists(combined))
            {
                return combined;
            }
        }
        return path;
    }

private:
    std::vector<std::filesystem::path> mPaths;
};

} // namespace Mitsuba

} // namespace Falcor
